The Budgeted Maximum Coverage Problem
نویسندگان
چکیده
The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted elements, and a budget L, nd a subset of S 0 S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0 is maximized. This problem is NP-hard. For the special case of this problem, where each set has unit cost, a (1 ? 1 e)-approximation is known. Yet, no approximation results are known for the general cost version. The contribution of this paper is a (1 ? 1 e)-approximation algorithm for the budgeted maximum coverage problem. We also argue that this approximation factor is the best possible, unless NP DTIME(n log log n).
منابع مشابه
Coping with Interference: From Maximum Coverage to Planning Cellular Networks
Cell planning includes planning a network of base stations providing a coverage of the service area with respect to current and future traffic requirements, available capacities, interference, and the desired quality-of-service. This paper studies cell planning under budget constraints through a very close-to-practice model. This problem generalizes several problems such as budgeted maximum cov...
متن کاملThe Ground-Set-Cost Budgeted Maximum Coverage Problem
We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph G = (V,E), where each vertex has a non-negative cost and a non-negative profit. The goal is to select a set of hyperedges T ⊆ E such that the total cost of the vertices covered by T is at most B and the total profit of all covered vertices is maximized. Besides being a natur...
متن کاملBudgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network
The Emerging Infections Network (EIN) (http://ein.idsociety.org/) is a CDC supported “sentinel” network of over 1400 members (currently), designed to connect clinical infectious disease specialists and public health officials. Members primarily communicate through an EIN managed listserv and discuss disease outbreaks, treatment protocols, effectiveness of vaccinations and other disease-control ...
متن کاملThe Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 + )-approximation for every > 0, and then use partial enumeration to reduce the approximation ratio to e e−1 + .
متن کاملThe Budgeted Unique Coverage Problem and Color-Coding
We show, by a non-trivial application of the color-coding method of Alon et al. [2], that BUDGETED UNIQUE COVERAGE (a variant of SET COVER) is fixed-parameter tractable, answering an open problem posed in [13]. We also give improved fixed-parameter tractable algorithms for two special cases of BUDGETED UNIQUE COVERAGE: UNIQUE COVERAGE (the unweighted version) and BUDGETED MAX CUT. To derandomiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 70 شماره
صفحات -
تاریخ انتشار 1999